منابع مشابه
Subtree matching by pushdown automata
Subtree matching is an important problem in Computer Science on which a number of tasks, such as mechanical theorem proving, term-rewriting, symbolic computation and nonprocedural programming languages are based on. A systematic approach to the construction of subtree pattern matchers by deterministic pushdown automata, which read subject trees in prefix and postfix notation, is presented. The ...
متن کاملString Suffix Automata and Subtree Pushdown Automata
String suffix automata accept all suffixes of a given string and belong to the fundamental stringology principles. Extending their transitions by specific pushdown operations results in new subtree pushdown automata, which accept all subtrees of a given subject tree in prefix notation and are analogous to the suffix automata in their properties. The deterministic subtree pushdown automaton acce...
متن کاملPushdown Automata
Families of Languages AFL thm if F is closed under substitution with λ-free regular sets, morphism, union with regular sets [easy for cfg] & intersection with regular sets, then F is closed under inverse morphism Figure 26: closure properties of CF II 12 intersection with regular languages a;A/α a a;A/α λ;A/α λ;A/α { } } { ⇒ ⇒ { anbn | n ≥ 1 }∗ ∩ { w ∈ {a, b}∗ |#ax even } r1 p1 q1 r0 p0 q0 r p ...
متن کاملOptimal Regular Tree Pattern Matching Using Pushdown Automata
We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a pushdown automaton in contrast with the conventionally generated tree pattern matching automaton. Our technique can handle a larger class of cost augmented regular tree grammars than can be preprocessed by conventional methods,...
متن کاملMonadic Quantifiers Recognized by Deterministic Pushdown Automata
I characterize the class of type 〈1〉 quantifiers (or, equivalently, type 〈1, 1〉 quantifiers satisfying Conservativity and Extension) that are recognized by deterministic pushdown automata in terms of the associated semilinear sets of vectors in N. These semilinear sets are finite unions of linear sets with at most two generators each, which are taken from a common three-element set of the form ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Information Systems
سال: 2010
ISSN: 1820-0214,2406-1018
DOI: 10.2298/csis1002331f